package com.wfm.niuke.dynamic;

public class BM72P剑指Offer42连续子数组的最大和 {
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int maxSubArray(int[] nums) {
        return 0;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

    public static void main(String[] args) { 
        Solution solution = new BM72P剑指Offer42连续子数组的最大和().new Solution();
    }
}